Inference at * 1 
Iof proof for Lemma wellfounded functionality wrt iff:



1. T1 : Type
2. T2 : Type
3. r1 : T1T1
4. r2 : T2T2
5. T1 = T2
6. x,y:T1. r1(x,y)  r2(x,y)
  WellFnd{i}(T1;x,y.r1(x,y))  WellFnd{i}(T2;x,y.r2(x,y)) 

latex

 by D 0 

latex

 1: 

 1:   WellFnd{i}(T1;x,y.r1(x,y))  WellFnd{i}(T2;x,y.r2(x,y))
 2: 

 2:   WellFnd{i}(T1;x,y.r1(x,y))  WellFnd{i}(T2;x,y.r2(x,y))
 .

Definitions	P  Q, P  Q
Lemmas	iff wf, rev implies wf, wellfounded wf